Quantitative analysis of a subgradient-type method for equilibrium problems

Abstract We use techniques originating from the subdiscipline of mathematical logic called ‘proof mining’ to provide rates metastability and—under a metric regularity assumption—rates convergence for subgradient-type algorithm solving equilibrium problem in convex optimization over fixed-point sets firmly nonexpansive mappings. The is due H. Iiduka and I. Yamada who 2009 gave noneffective proof its convergence. This case study illustrates applicability logic-based abstract quantitative analysis general forms Fejér monotonicity as given by second author previous papers.